Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
نویسندگان
چکیده
منابع مشابه
Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain infinitely many of equality and inequality constraints with arbitrary (may not be compact) index sets. These problems reduce to semi-infinite programs in the case of finite-d...
متن کاملOptimality Conditions for Semi-infinite and Generalized Semi-infinite Programs via lp Exact Penalty Functions
In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...
متن کاملConstraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
For an inequality system defined by an infinite family of proper convex functions (not necessarily lower semicontinuous), we introduce some new notions of constraint qualifications. Under the new constraint qualifications, we provide necessary and/or sufficient conditions for the KKT rules to hold. Similarly, we provide characterizations for constrained minimization problems to have total Lagra...
متن کاملMathematical programs with vanishing constraints: optimality conditions and constraint qualifications
We consider a difficult class of optimization problems that we call a mathematical program with vanishing constraints. Problems of this kind arise in various applications including optimal topology design problems of mechanical structures. We show that some standard constraint qualifications like LICQ and MFCQ usually do not hold at a local minimum of our program, whereas the Abadie constraint ...
متن کاملSubdifferentials of Value Functions and Optimality Conditions for Some Classes of Dc and Bilevel Infinite and Semi-infinite Programs
The paper concerns the study of new classes of parametric optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain, among other constraints, infinitely many of inequality constraints. These problems reduce to semi-infinite programs in the case of finite-dimensional spaces of decision variables. We foc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2013
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-013-0672-x